The number of points in a matroid with no n-point line as a minor
نویسندگان
چکیده
For any positive integer l we prove that if M is a simple matroid with no (l + 2)-point line as a minor and with sufficiently large rank, then |E(M)| ≤ q r(M)−1 q−1 , where q is the largest prime power less than or equal to l. Equality is attained by projective geometries over GF(q).
منابع مشابه
The Number of Points in a Combinatorial Geometry with No 8-point-line Minors
We show that when n is greater than 3, the number of points in a combinatorial geometry (or simple matroid) G of rank n containing no minor isomorphic to the 8-point line is at most 1 4 (5n − 1). This bound is sharp and is attained if and only if the geometry G is the projective geometry PG(n − 1, 5) over the field GF(5). This paper appeared in: Mathematical Essays in Honor of Gian-Carlo Rota, ...
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملMATROIDS WITH NO (q + 2)-POINT-LINE MINORS
It is known that a geometry with rank r and no minor isomorphic to the (q + 2)-point line has at most (qr − 1)/(q − 1) points, with strictly fewer points if r > 3 and q is not a prime power. For q not a prime power and r > 3, we show that qr−1 − 1 is an upper bound. For q a prime power and r > 3, we show that any rank-r geometry with at least qr−1 points and no (q + 2)-point-line minor is repre...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملOn Maximum-sized k-Regular Matroids
Let k be an integer exceeding one. The class of k–regular matroids is a generalization of the classes of regular and near-regular matroids. A simple rank–r regular matroid has the maximum number of points if and only if it is isomorphic to M(Kr+1), the cycle matroid of the complete graph on r + 1 vertices. A simple rank–r near-regular matroid has the maximum number of points if and only if it i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 100 شماره
صفحات -
تاریخ انتشار 2010